Higher-Order Jacobsthal–Lucas Quaternions
نویسندگان
چکیده
In this work, we define higher-order Jacobsthal–Lucas quaternions with the help of numbers. We examine some identities quaternions. introduce their basic definitions and properties. give Binet’s formula, Cassini’s identity, Catalan’s d’Ocagne generating functions, exponential functions also relations between Jacobsthal
منابع مشابه
Higher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملHigher-Order Aspects in Order
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if pointcuts in AspectJ, or simply all pointcuts in higher-order aspect languages like AspectScheme. While viewing pointcuts and advice as base level computation clearly distinguishes AOP from reflection, it also comes at ...
متن کاملHigher Order Functions Considered Unnecessary for Higher Order Programming
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions, and many interesting examples have been given showing the power of this approach. Unfortunately, the logic of higher order functions is diicult, and in particular, higher order uniication is undecidable. Moreover (and closely related), higher order expressions are n...
متن کاملVerifying Higher-Order Imperative Programs with Higher-Order Separation Logic
In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. To do this, I develop a model higher-order imperative programming language, and develop a program logic for it. I demonstrate the power of my program logic by verifying a series of examples, culminating in the correctness proof of a...
متن کاملTyped Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these systems into ordinary (£rst-order) rewrite systems and the subsequent application of conventional narrowing strategies. Our translation is an adaptation to narrowing of Warren’s translation, but unlike similar previous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11120671